An algorithm to increase the node-connectivity of a digraph by one
نویسندگان
چکیده
We develop a combinatorial polynomial-time algorithm to make a (k − 1)-connected digraph k-connected by adding a minimum number of new edges. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
ENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS
Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have be...
متن کاملSufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient condi...
متن کاملIncreasing the rooted-connectivity of a digraph by one
D.R. Fulkerson 1976] described a two-phase greedy algorithm to nd a minimum cost spanning arborescence and to solve the dual linear program. This was extended by the present author for "kernel systems", a model including the rooted edge-connectivity augmentation problem, as well. A similar type of method was developed by D. Kornblum 1978] for "lattice polyhedra", a notion introduced by A. Hooma...
متن کاملFeature Selection Based on Genetic Algorithm in the Diagnosis of Autism Disorder by fMRI
Background: Autism Spectrum Disorder (ASD) occurs based on the continuous deficit in a person’s verbal skills, visual, auditory, touch, and social behavior. Over the last two decades, one of the most important approaches in studying brain functions in autistic persons is using functional Magnetic Resonance Imaging (fMRI). Objectives: It is common to use all brain regions in functional extracti...
متن کاملLeach Routing Algorithm Optimization through Imperialist Approach
Routing is an important challenge in WSN due to the presence of hundreds or thousands of sensor nodes. Low Energy Adaptive Clustering Hierarchy (LEACH) is a hierarchical routing and data dissemination protocol. LEACH divides a network domain into several sub-domains that are called clusters. Non-uniformity of cluster distribution and CHs selection without considering the positions of other sens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Optimization
دوره 5 شماره
صفحات -
تاریخ انتشار 2008